On the Entropy and Letter Frequencies of Powerfree Words
نویسندگان
چکیده
We review the recent progress in the investigation of powerfree words, with particular emphasis on binary cubefree and ternary squarefree words. Besides various bounds on the entropy, we provide bounds on letter frequencies and consider their empirical distribution obtained by an enumeration of binary cubefree words up to length 80.
منابع مشابه
On the Entropy and Letter Frequencies of Ternary Square-Free Words
We enumerate all ternary length-` square-free words, which are words avoiding squares of words up to length `, for ` ≤ 24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary square-free words. We then consider ternary square-free words with fixed letter densities, thereby proving exponential growth for certain ensemble...
متن کاملOn the letter frequencies and entropy of written Marathi
We carry out a comprehensive analysis of letter frequencies in contemporary written Marathi. We determine sets of letters which statistically predominate any large generic Marathi text, and use these sets to estimate the entropy of Marathi.
متن کاملStatistical mechanics of letters in words.
We consider words as a network of interacting letters, and approximate the probability distribution of states taken on by this network. Despite the intuition that the rules of English spelling are highly combinatorial and arbitrary, we find that maximum entropy models consistent with pairwise correlations among letters provide a surprisingly good approximation to the full statistics of words, c...
متن کاملToward a statistical mechanics of four letter words
We consider words as a network of interacting letters, and approximate the probability distribution of states taken on by this network. Despite the intuition that the rules of English spelling are highly combinatorial (and arbitrary), we find that maximum entropy models consistent with pairwise correlations among letters provide a surprisingly good approximation to the full statistics of four l...
متن کاملUniformly balanced words with linear complexity and prescribed letter frequencies
We consider the following problem. Let us fix a finite alphabet A = {1,2, · · · ,d}; for any d-uple of letter frequencies ( f1, · · · , fd) ∈ [0,1]d with ∑i=1 fi = 1, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u is uniformly balanced, the letter frequencies in u are given by ( f1, · · · , fd). This paper investi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Entropy
دوره 10 شماره
صفحات -
تاریخ انتشار 2008